A Design of Automatic Visualizations for Divide-and-Conquer Algorithms
نویسندگان
چکیده
The paper addresses the design of program visualizations adequate to represent divideand-conquer algorithms. Firstly, we present the results of several surveys performed on the visualization of divide-and-conquer algorithms in the literature. Secondly, we make a proposal for three complementary, coordinated views of these algorithms. In summary, they are based an animation of the activation tree, an animation of the data structure, and a sequence of visualizations of the substructures, respectively.
منابع مشابه
Free Vibration Analysis of Repetitive Structures using Decomposition, and Divide-Conquer Methods
This paper consists of three sections. In the first section an efficient method is used for decomposition of the canonical matrices associated with repetitive structures. to this end, cylindrical coordinate system, as well as a special numbering scheme were employed. In the second section, divide and conquer method have been used for eigensolution of these structures, where the matrices are in ...
متن کاملmQAPViz: A divide-and-conquer multi-objective optimization algorithm to compute large data visualizations
Modern digital products and services are instrumental in understanding users activities and behaviors. In doing so, we have to extract relevant relationships and paerns from extensive data collections eciently. Data visualization algorithms are essential tools in transforming data into narratives. Unfortunately, very few visualization algorithms can handle a signicant amount of data. In this...
متن کاملطراحی ساختاری به روشDivide & Conquer و کاربرد آن در طراحی سوئیچ MSC
This paper presents the structural design for huge systems using Divide & Conquer (D&C) method as a scientific method for optimum designing of complex systems. This method divides the main system into several simple subsystems. Submitted equations in three different cases prove that the optimum response (number of subsystems for minimum system complexity) is independent of main system complexit...
متن کاملThe Design of Divide and Conquer Algorithms
The structure common to a class of divide and conquer algorithms is represented by a program scheme. A theorem is presented which relates the functionality of a divide and conquer algorithm to its structure and the functionalities of its subalgorithms. Several strategies for designing divide and conquer algorithms arise from this theorem and they are used to formally derive algorithms for sorti...
متن کاملSupporting Divide-and-Conquer Algorithms for Image Processing
Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconneo tion scheme such as a mesh, mesh with broadcasting, tree, pyramid, mesh-of-trees, PRAM, or hypercube, and can be used either on a machin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 224 شماره
صفحات -
تاریخ انتشار 2009